Strongly Secure Privacy Amplification Cannot Be Obtained by Encoder of Slepian-Wolf Code

Secure Storage of Fingerprint Biometrics Using Slepian-Wolf Codes

We describe a method to encode fingerprint biometrics securely for use, e.g., in encryption or access control. The system is secure because the stored data suffices to validate a probe fingerprint but not to recreate the original fingerprint biometric. Therefore, a breach in database security does not lead to the loss of biometric data. We present a model for a secure biometric system for which...

Multiterminal Source Code Design Based on Slepian-Wolf coded quantization∗

Multiterminal (MT) source coding refers to separate lossy encoding and joint decoding of multiple correlated sources. This paper presents two practical MT coding schemes under the same general framework of Slepian-Wolf coded quantization (SWCQ) for both direct and indirect quadratic Gaussian MT source coding problems with two encoders. The first asymmetric SWCQ scheme relies on quantization and...

"Real" Slepian-Wolf codes

We provide a novel achievability proof of the Slepian-Wolf theorem for i.i.d. sources over finite alphabets. We demonstrate that random codes that are linear over the real field achieve the classical Slepian-Wolf rate region. For finite alphabets we show that decoding is equivalent to solving an integer program. The techniques used may be of independent interest for code design for a wide class...

Analysis of Slepian Wolf Coding

Construction of Slepian-Wolf Source Code and Broadcast Channel Code Based on Hash Property

The aim of this paper is to prove theorems for the Slepian-Wolf source coding and the broadcast channel coding (independent messages and no common message) based on the the notion of a stronger version of the hash property for an ensemble of functions. Since an ensemble of sparse matrices has a strong hash property, codes using sparse matrices can realize the achievable rate region. Furthermore...